Shapley value for differential network games: Theory and application

Shapley value for assignment games ∗

We consider the problem of the axiomatization of the Shapley value on the class of assignment games. We show that Shapley’s original [21], Young’s [24], Chun’s [7], van den Brink’s [2], (5-6) Hart and Mas-Colell’s [12] potential function and consistency approaches and Roth’s [19] characterization do not work on the class of assignment games. We also consider Myerson’s [15] axiomatization of the...

finding influential individual in Social Network graphs using CSCS algorithm and shapley value in game theory

In recent years, the social networks analysis gains great deal of attention. Social networks have various applications in different areas namely predicting disease epidemic, search engines and viral advertisements. A key property of social networks is that interpersonal relationships can influence the decisions that they make. Finding the most influential nodes is important in social networks b...

Shapley Value for Games with Externalities and Games on Graphs

The Shapley value [46] is one of the most important solution concepts in coalitional game theory. It was originally defined for classical model of a coalitional game, which is relevant to a wide range of economic and social situations. However, while in certain cases the simplicity is the strength of the classical coalitional game model, it often becomes a limitation. To address this problem, a...

Shapley value for constant-sum games

The Shapley value for bicooperative games

The aim of the present paper is to study a one-point solution concept for bicooperative games. For these games introduced by Bilbao (Cooperative Games on Combinatorial Structures, 2000), we define a one-point solution called the Shapley value, since this value can be interpreted in a similar way to the classical Shapley value for cooperative games. The main result of the paper is an axiomatic c...